An Adaptive Fast Gauss Transform in Two Dimensions
نویسندگان
چکیده
منابع مشابه
Fast Approximation of the Discrete Gauss Transform in Higher Dimensions
We present a novel approach for the fast approximation of the discrete Gauss transform in higher dimensions. The algorithm is based on the dual-tree technique and introduces a new Taylor series expansion. It compares favorably to existing methods especially when it comes to higher dimensions and a broad range of bandwidths. Numerical results with different datasets in up to 62 dimensions demons...
متن کاملThe Fast Gauss Transform
Many problems in applied mathematics require the evaluation of the sum of N Gaussians at M points in space. The work required for direct evaluation grows like NM as N and M increase; this makes it very expensive to carry out such calculations on a large scale. In this paper, an algorithm is presented which evaluates the sum of N Gaussians at M arbitrarily distributed points in C. (N + M) work, ...
متن کاملEfficient Non-Parametric Adaptive Color Modeling Using Fast Gauss Transform
Modeling the color distribution of a homogeneous region is used extensively for object tracking and recognition applications. The color distribution of an object represents a feature that is robust to partial occlusion, scaling and object deformation. A variety of parametric and non-parametric statistical techniques have been used to model color distributions. In this paper we present a non-par...
متن کاملThe Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by quadrature issues that arise in using integral equation methods for solving the heat equation on moving domains. In particular, robust high-order product integration methods require convolution with O(q) distinct Gaus...
متن کاملFast inverse transform sampling in one and two dimensions
We develop a computationally efficient and robust algorithm for generating pseudo-random samples from a broad class of smooth probability distributions in one and two dimensions. The algorithm is based on inverse transform sampling with a polynomial approximation scheme using Chebyshev polynomials, Chebyshev grids, and low rank function approximation. Numerical experiments demonstrate that our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2018
ISSN: 1064-8275,1095-7197
DOI: 10.1137/17m1159865